Confirmation as partial entailment: A representation theorem in inductive logic
نویسندگان
چکیده
Article history: Available online xxxx
منابع مشابه
Confirmation as partial entailment A corrected proof
Michael Schippers pointed out to us in personal correspondence an error in the proof of the main result in Crupi, V. and Tentori, K., ”Confirmation as partial entailment: A representation theorem”, Journal of Applied Logic, 11 (2013), pp. 364-372. The flaw spotted by Schippers is that Lemma 2 (p. 369) does not hold in its original formulation. In what follows, we recapitulate the proof in a cor...
متن کاملOn the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملInverse Entailment in Nonmonotonic Logic Programs
Inverse entailment (IE) is known as a technique for finding inductive hypotheses in Horn theories. When a background theory is nonmonotonic, however, IE is not applicable in its present form. The purpose of this paper is extending the IE technique to nonmonotonic inductive logic programming (ILP). To this end, we first establish a new entailment theorem in normal logic programs, then introduce ...
متن کاملOn Inductive Logic
Among the various meanings in \vhich the \vord 'probability' is used in everyday language, in the discussion of scientists, and in the theories of probability, there are especially t,vo ,vhich must be clearly distinguished. We shall use for them the terms 'probabilitYl' and 'probabilitY2'. ProbabilitYl is a logical concept, a certain logical relation between two sentences (or, alternatively, be...
متن کاملAutomated Cyclic Entailment Proofs in Separation Logic
We present a general automated proof procedure, based upon cyclic proof, for inductive entailments in separation logic. Our procedure has been implemented via a deep embedding of cyclic proofs in the HOL Light theorem prover. Experiments show that our mechanism is able to prove a number of non-trivial entailments involving inductive predicates.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Logic
دوره 11 شماره
صفحات -
تاریخ انتشار 2013